- encoding polynomial
- мат.кодирующий многочлен
English-Russian scientific dictionary. 2008.
encoding polynomial
Смотреть что такое "encoding polynomial" в других словарях:
Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial … Wikipedia
Polynomial code — In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the generator… … Wikipedia
Pseudo-polynomial time — In computational complexity theory, a numeric algorithm runs in pseudo polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input its number of digits).An ExampleConsider… … Wikipedia
64b/66b encoding — In data networking and transmission, 64B/66B is a line code that transforms 64 bit data to 66 bit line code to achieve DC balance and bounded disparity, and yet provide enough state changes to allow reasonable clock recovery. This means that… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Reed–Solomon error correction — Reed Solomon error correction is an error correcting code that works by oversampling a polynomial constructed from the data. The polynomial is evaluated at several points, and these values are sent or recorded. Sampling the polynomial more often… … Wikipedia
PCI Express — Not to be confused with PCI X. PCI Express Year created 2004 Created by Intel · Dell · IBM · … Wikipedia
Pulse-code modulation — PCM redirects here. For other uses, see PCM (disambiguation). Pulse code modulation (PCM) is a method used to digitally represent sampled analog signals. It is the standard form for digital audio in computers and various Blu ray, Compact Disc and … Wikipedia
